import binarysearchtree.BinarySearchTree;
import binarysearchtree.HashBack;

public class Test {
    public static void main(String[] args) {
        HashBack hashBack = new HashBack();
        hashBack.put(1,11);
        hashBack.put(2,22);
        hashBack.put(2,99);
        hashBack.put(5,55);
        hashBack.put(6,66);
        hashBack.put(7,77);
        hashBack.put(4,44);

        System.out.println(hashBack.get(9));
    }

    public static void main1(String[] args) {
        BinarySearchTree binarySearchTree = new BinarySearchTree();
        int[] array = {5,12,3,2,11,15};
        for (int i = 0; i < array.length; i++) {
            binarySearchTree.insert(array[i]);
        }
        binarySearchTree.remove(12);
        System.out.println("========w");
    }
}
